Translated sums of primitive sets
نویسندگان
چکیده
The Erd\H{o}s primitive set conjecture states that the sum $f(A) = \sum_{a\in A}\frac{1}{a\log a}$, ranging over any $A$ of positive integers, is maximized by prime numbers. Recently Laib, Derbal, and Mechik proved translated for $f(A,h) A}\frac{1}{a(\log a+h)}$ false starting at $h=81$, comparison with semiprimes. In this note we prove such falsehood occurs already $h= 1.04\cdots$, show translate best possible We also obtain results sums $k$-almost primes larger $k$.
منابع مشابه
Uniquely Remotal Sets in $c_0$-sums and $ell^infty$-sums of Fuzzy Normed Spaces
Let $(X, N)$ be a fuzzy normed space and $A$ be a fuzzy boundedsubset of $X$. We define fuzzy $ell^infty$-sums and fuzzy $c_0$-sums offuzzy normed spaces. Then we will show that in these spaces, all fuzzyuniquely remotal sets are singletons.
متن کاملReasoning with Sets and Sums of Sets
In this paper we introduce a decision procedure for the combined theory of sets, arithmetic and sums of sets, that can be used as abstraction for problems in verification. This theory and the developed decision procedures is also the first step in our path to develop decision procedures for more theories that can be used as abstraction in more situations, for example with the additional bridgin...
متن کاملSums of lexicographically ordered sets
We consider the problem of determining finite integer sets which are knapsack-solvable in linear time (that is, it is possible to determine in linear time, for any integer b, whether b can be expressed as a sum of distinct elements of that set) and where the largest element is as small as possible. We study the condition that the k-subsets (for fixed k) when lexicographically ordered have incre...
متن کاملuniquely remotal sets in $c_0$-sums and $ell^infty$-sums of fuzzy normed spaces
let $(x, n)$ be a fuzzy normed space and $a$ be a fuzzy boundedsubset of $x$. we define fuzzy $ell^infty$-sums and fuzzy $c_0$-sums offuzzy normed spaces. then we will show that in these spaces, all fuzzyuniquely remotal sets are singletons.
متن کاملPrimitive sets in a lattice
We study the problem of extending a primitive set of size k < n, in a lattice of rank n, to a basis of the lattice. Our approach relies on solving the matrix completion problem, and we show that the relevant computed matrices have nicely bounded entries. We present formulas, for the cases k = 1, n − 1 for an extended basis, and analyze the computational complexity for each of these two cases. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Mathematique
سال: 2022
ISSN: ['1631-073X', '1778-3569']
DOI: https://doi.org/10.5802/crmath.285